A Lower Bound on Embedding Tree Machines with Balanced Processor Utilization
نویسندگان
چکیده
In this paper we show that any embedding of a 2m + I-node complete binary tree T into an m-node complete binary tree H requires a dilation of at least 3 when every node of H is assigned one interior and one leaf node of T, except one node which is assigned one interior and two leaf nodes of T. aThis work was supported by the Office of Naval Research under Contracts NOOOl484-K-DS02 and NOOOl4-86-K-0689, and by the National Science Foundation under Grant MlP-57-15652.
منابع مشابه
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملA Lower Bound on Embedding Large Hypercubes into Small Hypercubes
The problem of embedding an N -processor architecture G into an M -processor architecture H for N > M arises when algorithms designed for architectures of an ideal size are simulated on existing architectures which are of a xed size. In this paper we present solutions to this embedding problem for the case when both architectures are hypercubes and the embeddings are to achieve a balanced load....
متن کاملLoad balanced tree embeddings
The problem of embedding an n-processor architecture T into an m-processor architecture H for n > m arises when algorithms designed for architectures of an ideal size are simulated on existing architectures which are of a fixed size. In this paper we present solutions to this embedding problem for the case when both architectures are complete binary trees and the embeddings are to achieve a bal...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کامل